// https://www.lintcode.com/problem/best-time-to-buy-and-sell-stock-ii/description

class Solution {
public:
    /**
     * @param prices: Given an integer array
     * @return: Maximum profit
     */
    int maxProfit(vector<int> &prices) {
        int profit = 0;
        for (int i = 1; i < prices.size(); ++i)
        {
            if (prices[i] > prices[i - 1])
                profit += prices[i] - prices[i - 1];

            // profit += max(prices[i] - prices[i - 1], 0);
        }
        return profit;
    }
};